Sharp bounds on distance spectral radius of graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharp Bounds on the PI Spectral Radius

In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.

متن کامل

sharp bounds on the pi spectral radius

in this paper some upper and lower bounds for the greatest eigenvalues of the pi and vertex pimatrices of a graph g are obtained. those graphs for which these bounds are best possible arecharacterized.

متن کامل

Some Sharp Upper Bounds on the Spectral Radius of Graphs

In this paper, we first give a relation between the adjacency spectral radius and the Q-spectral radius of a graph. Then using this result, we further give some new sharp upper bounds on the adjacency spectral radius of a graph in terms of degrees and the average 2-degrees of vertices. Some known results are also obtained.

متن کامل

On Complementary Distance Signless Laplacian Spectral Radius and Energy of Graphs

Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...

متن کامل

Sharp Upper Bounds on the Spectral Radius of the Laplacian Matrix of Graphs

Let G = (V,E) be a simple connected graph with n vertices and e edges. Assume that the vertices are ordered such that d1 ≥ d2 ≥ . . . ≥ dn, where di is the degree of vi for i = 1, 2, . . . , n and the average of the degrees of the vertices adjacent to vi is denoted by mi. Let mmax be the maximum of mi’s for i = 1, 2, . . . , n. Also, let ρ(G) denote the largest eigenvalue of the adjacency matri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear and Multilinear Algebra

سال: 2012

ISSN: 0308-1087,1563-5139

DOI: 10.1080/03081087.2012.707395